Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое bipartite graph - определение
Найдено результатов: 669
Bipartite graph
![A [[complete bipartite graph]] with ''m'' = 5 and ''n'' = 3](https://commons.wikimedia.org/wiki/Special:FilePath/Biclique K 3 5 bicolor.svg?width=200 "A [[complete bipartite graph]] with ''m'' = 5 and ''n'' = 3")
![The [[Heawood graph]] is bipartite.](https://commons.wikimedia.org/wiki/Special:FilePath/Heawood graph bipartite (bicolor).svg?width=200 "The [[Heawood graph]] is bipartite.")
GRAPH OF TWO DISJOINT SETS IN WHICH EVERY VERTEX IN ONE SET IS CONNECTED TO AT LEAST ONE IN THE OTHER
Bipartitie graph; Bipartite Graph; Bipartite graphs; Bipartite plot
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V, that is every edge connects a vertex in U to one in V. Vertex sets U and V are usually called the parts of the graph.
bipartite graph
GRAPH OF TWO DISJOINT SETS IN WHICH EVERY VERTEX IN ONE SET IS CONNECTED TO AT LEAST ONE IN THE OTHER
Bipartitie graph; Bipartite Graph; Bipartite graphs; Bipartite plot
Convex bipartite graph
In the mathematical field of graph theory, a convex bipartite graph is a bipartite graph with specific properties.
Chordal bipartite graph
In the mathematical area of graph theory, a chordal bipartite graph is a bipartite graph B = (X,Y,E) in which every cycle of length at least 6 in B has a chord, i.e.
Quasi-bipartite graph
In the mathematical field of graph theory, an instance of the Steiner tree problem (consisting of an undirected graph G and a set R of terminal vertices that must be connected to each other) is said to be quasi-bipartite if the non-terminal vertices in G form an independent set, i.e.
Null graph
GRAPH WITHOUT EDGES (ON ANY NUMBER OF VERTICES)
Empty tree; Empty graph; Null Graph; Null tree; Singleton graph; Edgeless graph; Order-zero graph
In the mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes called an "empty graph").
Complete bipartite graph
![4,7}}}} showing that [[Turán's brick factory problem]] with 4 storage sites (yellow spots) and 7 kilns (blue spots) requires 18 crossings (red dots)](https://commons.wikimedia.org/wiki/Special:FilePath/Zarankiewicz K4 7.svg?width=200 "4,7}}}} showing that [[Turán's brick factory problem]] with 4 storage sites (yellow spots) and 7 kilns (blue spots) requires 18 crossings (red dots)")
EVERY VERTEX OF FIRST SET ATTACHED TO EVERY VERTEX OF SECOND SET
Biclique; Complete bigraph
In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first set is connected to every vertex of the second set... Electronic edition, page 17.
Turán graph
![The [[octahedron]], a 3-[[cross polytope]] whose edges and vertices form ''K''<sub>2,2,2</sub>, a Turán graph ''T''(6,3). Unconnected vertices are given the same color in this face-centered projection.](https://commons.wikimedia.org/wiki/Special:FilePath/Complex tripartite graph octahedron.svg?width=200 "The [[octahedron]], a 3-[[cross polytope]] whose edges and vertices form ''K''<sub>2,2,2</sub>, a Turán graph ''T''(6,3). Unconnected vertices are given the same color in this face-centered projection.")
GRAPH
Turan graph; Cocktail party graph; Octahedral Graph; Octahedral graph
The Turán graph, denoted by T(n,r), is a complete multipartite graph; it is formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and then connecting two vertices by an edge if and only if they belong to different subsets. Where q and s are the quotient and remainder of dividing n by r (so n = qr + s), the graph is of the form K_{q+1, q+1, \ldots, q, q}, and the number of edges is
Dense graph
GRAPH IN WHICH THE NUMBER OF EDGES IS CLOSE TO THE MAXIMUM FOR ITS NUMBER OF VERTICES
Sparse graph; Graph density; Density (graph theory)
In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges (where every pair of vertices is connected by one edge). The opposite, a graph with only a few edges, is a sparse graph.
Butterfly graph
PLANAR GRAPH WITH 5 NODES AND 6 EDGES
Bowtie graph; Hourglass graph; Bowtie-free graphs; Bowtie-free graph
In the mathematical field of graph theory, the butterfly graph (also called the bowtie graph and the hourglass graph) is a planar undirected graph with 5 vertices and 6 edges.ISGCI: Information System on Graph Classes and their Inclusions.
